Context-free grammar for a two-dimensional language
نویسنده
چکیده
We describe in this paper a context-free grammar, with parameters, that generate models for covering a rectangular area with many smaller rectangular pieces. The generated language contains all the models that can be generated using only guillotine restrictions. The grammar was inspired by the practical problem of covering a rectangular room with carpet or linoleum. The source of rectangular pieces is considered to be of fixed width and of sufficient length. Every model starts with cuts of the same area as the target shape and works out the way of combining the pieces for optimal covering of the room.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملTwo-dimensional Context-free Grammars
We present a generalization of context-free grammars to twodimensions and define picture languages generated by these grammars. We examine some properties of the formed class and we describe how these languages can be recognized by two-dimensional forgetting au-
متن کاملStochastic Context-Free Grammars and RNA Secondary Structure Prediction
This thesis focus on the prediction of RNA secondary structure using stochastic context-free grammars (SCFG). The RNA secondary structure prediction problem consists of predicting a 2-dimensional structure from a 1-dimensional nucleotide sequence. The theory behind SCFG is explained and an overview of the research literature on various methods in the field of secondary structure prediction is g...
متن کاملUsing Linear Positional Grammars for the LR Parsing of 2-D Symbolic Languages
In this paper we present a grammar formalism for the generation and parsing of two-dimensional symbolic languages. Linear Positional Grammars (or LPGs for short) are an immediate generalization of the context-free string grammars. Through the use of general spatial relations they allow the definition of pictures whose symbols span on a two-dimensional space. Due to their analogy to context-free...
متن کاملThe Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars
The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language ...
متن کامل